Proving Goal Achievability
نویسنده
چکیده
Given an action theory, a goal, and a set of initial states, we consider the problem of checking whether the goal is always achievable in every initial state of the set. To address this problem, we introduce a notion of reduction between sets of states, and show that if the set of the initial states can be reduced to one of its subsets, then the problem is equivalent to checking whether the goal is achievable in every initial state of the subset, provided that all the variables in the goal, if any, are existentially quantified, and that the preconditions and effects of the actions can be specified by quantifier-free formulas. We believe that this result provides an effective way of proving goal achievability, and illustrate it through some examples.
منابع مشابه
An Incremental Learning Approach for Completable Planning
Many real world planning domains are complex and uncertain, preventing complete a priori planning. However, real world planners can also rely on runtime information to facilitate additional planning during execution. The completable approach to planning introduces the idea of completable steps, which represent deferred planning decisions. Through completable steps, a planner can defer particula...
متن کاملAchievability of an Incentive Mechanism for Gossip based Peer-to-Peer Streaming
We provide a generic achievability argument for incentives in gossip based p2p streaming by proving that after coupling a randomized optimistic unchoke mechanism to an incentive based gossip streaming algorithm we can (still) distribute a stream from one source to n peers in O(log n) time with high probability. We provide simulation results for a distributed incentive scheme for gossip based p2...
متن کاملThe Converse Part of The Theorem for Quantum Hoeffding Bound
We prove the converse part of the theorem for quantum Hoeffding bound on the asymptotics of quantum hypothesis testing, essentially based on an argument developed by Nussbaum and Szkola in proving the converse part of the quantum Chernoff bound. Our result complements Hayashi’s proof of the direct (achievability) part of the theorem, so that the quantum Hoeffding bound has now been established.
متن کاملVerified Planning by Deductive Synthesis in Intuitionistic Linear Logic
We describe a new formalisation in Isabelle/HOL of Intuitionistic Linear Logic and consider the support this provides for constructing plans by proving the achievability of given planning goals. The plans so found are provably correct, by construction. This representation of plans in linear logic provides a concise account of planning with sensing actions, allows the creation and deletion of ob...
متن کاملWhat Robots Can Do: Robot Programs and Effective Achievability
In this paper, we propose a definition of goal achievability: given a basic action theory describing an initial state of the world and some primitive actions available to a robot, including some actions which return binary sensing information, what goals can be achieved by the robot? The main technical result of the paper is a proof that a simple robot programming language is universal, in that...
متن کامل